Towards Distributed and Dynamic Task Reallocation
نویسندگان
چکیده
Distributed and dynamic task reallocation in multi-robot organization is motivated by the fact that most critical information for organizational performance must be obtained during problem solving and static techniques for task allocation cannot take the dynamic information into account. This paper presents Distributed Organizational Task Network (DOTN) as a representation for the problem, and proposes two local search techniques: trading tasks and trading responsibilities among robots, for searching the best DOTN based on global feedback. Experiments of an implemented algorithm called SOLO show a number of advantages of this approach, and illustrate some promising future research directions.
منابع مشابه
Distributed and Dynamic Task Reallocation in Robot Organizations
Task reallocation in a multi-robot organization is a process that distributes a decomposed global task to individual robots. This process must be distributed and dynamic because it relies on critical information that can only be obtained during mission execution. This paper presents a representation for this challenging problem and proposes an algorithm that allows member robots to trade tasks ...
متن کاملA Framework for Task Reallocation in Distributed Computing Systems with Non-Markovian Communication Delays
This paper presents a general framework for optimal task reallocation in heterogeneous distributed computing systems (DCSs). The framework relies on a rigorous analytical model for the stochastic execution time of a workload. The model takes into account the heterogeneity and randomness of both service times and communication delays, an arbitrary task-reallocation policy as well as the stochast...
متن کاملA Smart Algorithm for Dynamic Task Allocation for Distributed Processing Environment
A Distributed Processing Environment (DPE) consists of multiple autonomous computers that communicate through a communication media. In DPE a task is divided into many fractions and each of which is to be get processed. The task allocation problem can be explained in terms of number of tasks and number of processors available. In the present method propose a dynamic model for task allocation in...
متن کاملTask Reallocation for Maximal Reliability in Distributed Computing Systems with Uncertain Topologies and Non-Markovian Delays
The ability to model and optimize reliability is central in designing survivable distributed computing systems (DCSs) where servers are prone to fail permanently. In this paper the service reliability of a DCS in uncertain topologies is analytically characterized by using a novel regeneration-based probabilistic analysis. The analysis takes into account the stochastic failure times of servers, ...
متن کاملDYTAF: Dynamic Table Fragmentation in Distributed Database Systems
In distributed database systems, tables are frequently fragmented over a number of sites in order to reduce access costs. How to fragment and how to allocate the fragments to the sites is a challenging problem that has previously been solved either by static fragmentation and allocation, or based on query analysis. Many emerging applications of distributed database systems generate very dynamic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005